Segmentation of Exudates via Color-based K-means Clustering and Statistical-based Thresholding
نویسندگان
چکیده
منابع مشابه
A Real-Time Region-Based Motion Segmentation Using Adaptive Thresholding and K-Means Clustering
This paper presents an approach for a real-time region-based motion segmentation and tracking using an adaptive thresholding and k-means clustering in a scene, with focus on a video monitoring system. In order to reduce the computational load to the motion segmentation, the presented approach is based on the variation regions application of a weighted k-means clustering algorithm, followed by a...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملColor Image Segmentation Using a Spatial K-Means Clustering Algorithm
This paper details the implementation of a new adaptive technique for color-texture segmentation that is a generalization of the standard K-Means algorithm. The standard K-Means algorithm produces accurate segmentation results only when applied to images defined by homogenous regions with respect to texture and color since no local constraints are applied to impose spatial continuity. In additi...
متن کاملWhite Blood Cell Segmentation by Color-Space-Based K-Means Clustering
White blood cell (WBC) segmentation, which is important for cytometry, is a challenging issue because of the morphological diversity of WBCs and the complex and uncertain background of blood smear images. This paper proposes a novel method for the nucleus and cytoplasm segmentation of WBCs for cytometry. A color adjustment step was also introduced before segmentation. Color space decomposition ...
متن کاملGraph based k-means clustering
An original approach to cluster multi-component data sets is proposed that includes an estimation of the number of clusters. Using Prim’s algorithm to construct a minimal spanning tree (MST) we show that, under the assumption that the vertices are approximately distributed according to a spatial homogeneous Poisson process, the number of clusters can be accurately estimated by thresholding the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2017
ISSN: 1549-3636
DOI: 10.3844/jcssp.2017.524.536